SZTAKI@Imageclef2010
نویسندگان
چکیده
Our approach to the ImageCLEF 2010 tasks is based on Histogram of Oriented Gradients descriptors (HOG) and Okapi BM25 based text retrieval. We extracted feature vectors to describe the visual content of an image region or the entire image. We trained a Gaussian Mixture Model (GMM) to cluster the feature vectors extracted from the image regions. To represent each image with only one vector we computed a Bag-of-Words (BOW) model from GMM probabilities of HOG descriptors. We trained linear regression classificators for the Photo Annotation task. To improve our textual ranking in the Wikipedia MM task we successfully expanded the textual query based on the visual ranking.
منابع مشابه
RGU at ImageCLEF2010 Wikipedia Retrieval Task
This working notes paper describes our first participation in the ImageCLEF2010 Wikipedia Retrieval Task[1]. In this task, we mainly test our Quantum Theory inspired retrieval function on cross media retrieval. Instead of heuristically combining the ranking scores independently from different media types, we develop a tensor product based model to represent textual and visual content features o...
متن کاملMeiji University at ImageCLEF2010 Visual Concept Detection and Annotation Task
This paper describes the participation of the Web Science Laboratory of Meiji University in the ImageCLEF2010 photo annotation task. We devised a system that combines conceptual fuzzy sets with visual words that have become popular in the fields of image retrieval and recognition. The utility of the system was verified by comparing it with the ordinary Bag of Visual words technique. In addition...
متن کاملText recognition , event detection and some theoretical aspects of cellular wave computer architectures
Cellular wave algorithms with semantic embedding and a new graph representation of cellular binary dynamics to investigate invertibility (MTA-SZTAKI) " Ask, and it shall be given you; seek, and ye shall find; knock, and it shall be opened unto you. " Mt 7:7.
متن کاملFinding small patterns in permutations in linear time
Given two permutations σ and π, the Permutation Pattern problem asks if σ is a subpattern of π. We show that the problem can be solved in time 2 2 log `) ·n, where ` = |σ| and n = |π|. In other words, the problem is fixed-parameter tractable parameterized by the size of the subpattern to be found. We introduce a novel type of decompositions for permutations and a corresponding width measure. We...
متن کاملTitle: Virtual Learning Centre Published S-cube Documents the S-cube Deliverable Series Vision and Objectives of S-cube
The research leading to these results has received funding from the European Community's Seventh Framework Programme FP7/2007-2013 under grant agreement n° 215483 (S-Cube). Title: Virtual Learning Centre Authors: UniDue, Tilburg, CITY, INRIA, Lero, Polimi, SZTAKI, TUW, UOC,UPM, USTUTT, VUA Editor: Harald Psaier (TUW) Reviewers: Philipp Leitner (TUW) Martin Treiber (TUW) Identifier: CD-SoE-1.1.6...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010